XNN Graph

نویسندگان

  • Pasi Fränti
  • Radu Mariescu-Istodor
  • Caiming Zhong
چکیده

K-nearest neighbor graph (KNN) is a widely used tool in several pattern recognition applications but it has drawbacks. Firstly, the choice of k can have significant impact on the result because it has to be fixed beforehand, and it does not adapt to the local density of the neighborhood. Secondly, KNN does not guarantee connectivity of the graph. We introduce an alternative data structure called XNN, which has variable number of neighbors and guarantees connectivity. We demonstrate that the graph provides improvement over KNN in several applications including clustering, classification and data analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremes on Trees

This paper considers the asymptotic distribution of the longest edge of the minimal spanning tree and nearest neighbor graph on X1, . . . ,XNn where X1,X2, . . . are i.i.d. in R 2 with distribution F and Nn is independent of the Xi and satisfies Nn/n→p 1. A new approach based on spatial blocking and a locally orthogonal coordinate system is developed to treat cases for which F has unbounded sup...

متن کامل

An Anscombe-type Theorem

Let (Xn) be a sequence of random variables (with values in a separable metric space) and (Nn) a sequence of random indices. Conditions for XNn to converge stably (in particular, in distribution) are provided. Some examples, where such conditions work but those already existing fail, are given as well.

متن کامل

Extremes of Independent Gaussian Processes

For every n ∈ N, let X1n, . . . , Xnn be independent copies of a zero-mean Gaussian process Xn = {Xn(t), t ∈ T}. We describe all processes which can be obtained as limits, as n → ∞, of the process an(Mn − bn), where Mn(t) = maxi=1,...,n Xin(t) and an, bn are normalizing constants. We also provide an analogous characterization for the limits of the process anLn, where Ln(t) = mini=1,...,n |Xin(t)|.

متن کامل

Conjectures on the ring of commuting matrices

Let X = (xij) and Y = (yij) be generic n by n matrices and Z = XY − Y X. Let S = k[x11, . . . , xnn, y11, . . . , ynn], where k is a field, let I be the ideal generated by the entries of Z and let R = S/I . We give a conjecture on the first syzygies of I , show how these can be used to give a conjecture on the canonical module of R. Using this and the Hilbert series of I we give a conjecture on...

متن کامل

Non-exponential Stability and Decay Rates in Nonlinear Stochastic Difference Equation with Unbounded Noises

We consider stochastic difference equation xn+1 = xn ( 1− hf(xn) + √ hg(xn)ξn+1 ) , n = 0, 1, . . . , x0 ∈ R, where functions f and g are nonlinear and bounded, random variables ξi are independent and h > 0 is a nonrandom parameter. We establish results on asymptotic stability and instability of the trivial solution xn ≡ 0. We also show, that for some natural choices of the nonlinearities f and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016